Sparse domination and the strong maximal function
نویسندگان
چکیده
منابع مشابه
The Multilinear Strong Maximal Function
A multivariable version of the strong maximal function is introduced and a sharp distributional estimate for this operator in the spirit of the Jessen, Marcinkiewicz, and Zygmund theorem is obtained. Conditions that characterize the boundedness of this multivariable operator on products of weighted Lebesgue spaces equipped with multiple weights are obtained. Results for other multi(sub)linear m...
متن کاملPerfect graphs of strong domination and independent strong domination
Let γ(G), i(G), γS(G) and iS(G) denote the domination number, the independent domination number, the strong domination number and the independent strong domination number of a graph G, respectively. A graph G is called γi-perfect (domination perfect) if γ(H) = i(H), for every induced subgraph H of G. The classes of γγS-perfect, γSiS-perfect, iiS-perfect and γiS-perfect graphs are defined analog...
متن کاملHypergraph Domination and Strong Independence
We solve several conjectures and open problems from a recent paper by Acharya [2]. Some of our results are relatives of the Nordhaus–Gaddum theorem, concerning the sum of domination parameters in hypergraphs and their complements. (A dominating set in H is a vertex set D ⊆ X such that, for every vertex x ∈ X\D there exists an edge E ∈ E with x ∈ E and E∩D 6= ∅.) As an example, it is shown that ...
متن کاملunicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
a 2-emph{rainbow dominating function} (2rdf) on a graph $g=(v, e)$ is afunction $f$ from the vertex set $v$ to the set of all subsets of the set${1,2}$ such that for any vertex $vin v$ with $f(v)=emptyset$ thecondition $bigcup_{uin n(v)}f(u)={1,2}$ is fulfilled. a 2rdf $f$ isindependent (i2rdf) if no two vertices assigned nonempty sets are adjacent.the emph{weight} of a 2rdf $f$ is the value $o...
متن کاملStrong weak domination and domination balance in a graph
Let G = (V, E) be a graph and u, v ~ V. Then, u strongly dominates v and v weakly dominates u if (i) uv ~ E and (ii) deg u >/deg v. A set D c V is a strong-dominating set (sd-set) of G if every vertex in V D is strongly dominated by at least one vertex in D. Similarly, a weak-dominating set (wd-set) is defined. The strong (weak) domination number 7s (7w) of G is the minimum cardinality of an sd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2019
ISSN: 0001-8708
DOI: 10.1016/j.aim.2019.01.007